Finding Hidden Independent Sets in Interval Graphs
نویسندگان
چکیده
Consider a game in a given set of intervals (and their implied interval graph G) in which the adversary chooses an independent setX in G. The goal is to discover this hidden independent set X by making the fewest queries of the form “Is point p covered by an interval inX?” Our interest in this problem stems from two applications: experimental gene discovery with PCR technology and the game of Battleship (in a 1-dimensional setting). We provide adaptive algorithms for both the verification scenario (given an independent set, is it X?) and the discovery scenario (find X without any information). Under some assumptions, these algorithms use an asymptotically optimal number of queries in every instance.
منابع مشابه
INDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملMAN-MACHINE INTERACTION SYSTEM FOR SUBJECT INDEPENDENT SIGN LANGUAGE RECOGNITION USING FUZZY HIDDEN MARKOV MODEL
Sign language recognition has spawned more and more interest in human–computer interaction society. The major challenge that SLR recognition faces now is developing methods that will scale well with increasing vocabulary size with a limited set of training data for the signer independent application. The automatic SLR based on hidden Markov models (HMMs) is very sensitive to gesture's shape inf...
متن کاملReconfiguration of Colorable Sets in Classes of Perfect Graphs
A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph. This problem generalizes the well-studied Independent Set Reconfiguration problem. As the first step toward a systematic understanding of the complexi...
متن کاملToken Sliding on Chordal Graphs
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I . We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two independent sets I and J , the TOKEN SLIDING problem consists in deciding whether there exists a sequence of independent sets which transforms I into J so that eve...
متن کاملCamou aging Independent Sets in Quasi-Random Graphs
In this paper, we look at the problem of how one might try to hide a large independent set in a graph in which all other independent sets are signiicantly smaller. We observe that the most common methods of generating graphs with known maximal independent sets are subject to attack using quite simple techniques that are successful signiicantly often for graphs of practical size. We present an i...
متن کامل